Random Walks on Dicyclic Group
نویسندگان
چکیده
In this paper I work out the rate of convergence of a non-symmetric random walk on the dicyclic group (Dicn) and that of its symmetric analogue on the same group. The analysis is via group representation techniques from Diaconis (1988) and closely follows the analysis of random walk on cyclic group in Chapter 3C of Diaconis. I find that while the mixing times (the time for the random walk to get “random”) for the non-symmetric and the symmetric random walks on Dicn are both on the order of n, the symmetric random walk will take approximately twice as long to get “random” as the non-symmetric walk.
منابع مشابه
A PRELUDE TO THE THEORY OF RANDOM WALKS IN RANDOM ENVIRONMENTS
A random walk on a lattice is one of the most fundamental models in probability theory. When the random walk is inhomogenous and its inhomogeniety comes from an ergodic stationary process, the walk is called a random walk in a random environment (RWRE). The basic questions such as the law of large numbers (LLN), the central limit theorem (CLT), and the large deviation principle (LDP) are ...
متن کاملRandom Walk in an Alcove of an Affine Weyl Group, and Non-colliding Random Walks on an Interval
Abstract. We use a reflection argument, introduced by Gessel and Zeilberger, to count the number of k-step walks between two points which stay within a chamber of a Weyl group. We apply this technique to walks in the alcoves of the classical affine Weyl groups. In all cases, we get determinant formulas for the number of k-step walks. One important example is the region m > x1 > x2 > · · · > xn ...
متن کاملAutomorphisms of Cayley graphs on generalised dicyclic groups
A graph is called a GRR if its automorphism group acts regularly on its vertex-set. Such a graph is necessarily a Cayley graph. Godsil has shown that there are only two infinite families of finite groups that do not admit GRRs: abelian groups and generalised dicyclic groups [4]. Indeed, any Cayley graph on such a group admits specific additional graph automorphisms that depend only on the group...
متن کاملOn isomorphisms of Cayley digraphs on dicyclic groups
In this paper we prove that for any m E {I, 2, 3}, the dicyclic group B 4n (n i=2) is an m-DCI group if and only if n is odd.
متن کاملRandom Walks on Finite Quantum Groups
1 Markov chains and random walks in classical probability . . 3 2 Quantum Markov chains . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 3 Random walks on comodule algebras . . . . . . . . . . . . . . . . . . . . . . 7 4 Random walks on finite quantum groups . . . . . . . . . . . . . . . . . . 11 5 Spatial Implementation . . . . . . . . . . . . . . . . . . . . . . . . . . ....
متن کامل